class Solution {
public:
    int findMin(vector<int>& nums) {
        //1:变种二分查找
        int left = 0;
        int right = nums.size()-1;
        int x = nums[right];
        while(left < right){
            int mid = left +(right - left)/2;
            if(nums[mid] > x) left = mid + 1;
            else right = mid;

        }
        return nums[left];
    }
};
